Systematic Partitioning of Proteins for Quantum-Chemical Fragmentation Methods Using Graph Algorithms

نویسندگان

چکیده

Quantum-chemical fragmentation methods offer an efficient approach for the treatment of large proteins, in particular if local target quantities such as protein–ligand interaction energies, enzymatic reaction or spectroscopic properties embedded chromophores are sought. However, accuracy that is achievable intricately depends on how protein partitioned into smaller fragments. While commonly employed naı̈ve using fragments with a fixed size widely used, it can result and unpredictable errors when varying fragment size. Here, we present systematic partitioning scheme aims at minimizing error quantity given maximum To this end, construct weighted graph representation protein, which amino acids constitute nodes. These nodes connected by edges estimate expected cutting edge. This allows us to employ algorithms provided computer science determine near-optimal partitions protein. We apply test set six proteins representing various prototypical applications quantum-chemical simplified molecular fractionation conjugate caps (MFCC) hydrogen caps. show our graph-based consistently improves upon approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

development of different optical methods for determination of glucose using cadmium telluride quantum dots and silver nanoparticles

a simple, rapid and low-cost scanner spectroscopy method for the glucose determination by utilizing glucose oxidase and cdte/tga quantum dots as chromoionophore has been described. the detection was based on the combination of the glucose enzymatic reaction and the quenching effect of h2o2 on the cdte quantum dots (qds) photoluminescence.in this study glucose was determined by utilizing glucose...

Graph Partitioning Using Genetic Algorithms

The eecient implementation of parallel processing ar-chitectures generally requires the solution of hard combi-natorial problems involving allocation and scheduling of tasks. Such problems can often be modelled with considerable accuracy as a graph partitioning problem|a problem well-known from complexity theory to be NP-hard, which implies that for practical purposes the global optimum will no...

متن کامل

Engineering Graph Partitioning Algorithms

The paper gives an overview of our recent work on balanced graph partitioning – partition the nodes of a graph into k blocks such that all blocks have approximately equal size and such that the number of cut edges is small. This problem has numerous applications for example in parallel processing. We report on a scalable parallelization and a number of improvements on the classical multilevel a...

متن کامل

Fast Graph Partitioning Algorithms

{ In this work, the following k-way graph partitioning (GP) problem is considered: given an undirected weighted graph G(V; E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in diierent parts) is minimized. Two simple and fast algorithms are proposed, namely, direct algorithm Auction and iterative algorithm GreedyC...

متن کامل

using partitioning and non-partitioning clustering algorithms for included proteins sequences in esophagus, stomach and colon cancer

a thorough recognition of the nature and duties of the genes is based upon having adequate information about the proteins. however, the proteomic projects follow a slow trend; therefore, solving the protein-related problems has become as one of the most important challenges in bio-informatics. consequently, the presence of tools which can enhance the structural recognition, classification, and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemical Theory and Computation

سال: 2021

ISSN: ['1549-9618', '1549-9626']

DOI: https://doi.org/10.1021/acs.jctc.0c01054